Performance Analysis of Flow Time Based Dispatching Rules with Unreliable Machines
نویسنده
چکیده
This research paper focuses on the simulation-based comparative study of several new dispatching rules with the existing ones for the minimisation of flow time based performance measures such as mean flow time, maximum flow time and variance of flow time. The authors have proposed five new flow time based dispatching rules. The best of existing rules such as PT+PW, AT, AT-RPT, FDD and the standard benchmark rules such as SPT, FIFO are considered for the comparative study with the new proposed rules. Simulation studies are conducted under varying shop utilisation, breakdown and mean time to repair to rank performance of the considered rules. Shop floor machines are subjected to failures during this study. 17 refs.
منابع مشابه
New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملAnalysis And Comparison Of Dispatching Rule - Based Scheduling In Dual - Resource Constrained Shop - Floor Scenarios
-There has been a lot of research about scheduling manufacturing systems with dispatching rules in the past. However, most studies concentrate on simplified scenarios considering only one type of resource, usually machines. In this study dispatching rules are applied to a more realistic scenario, which is dual constrained by machines and operators and has a re-entrant process flow. Interdepende...
متن کاملDynamic routing strategies for JIT production in hybrid flow shops
In production processes, just-in-time (JIT) completion of jobs helps reduce both the inventory and late delivery of finished products. Previous research which aims to achieve JIT job completion mainly worked on static scheduling problems, in which all jobs are available from time zero or the available time of each job is known beforehand. In contrast, dynamic scheduling problems which involve c...
متن کاملThe performance of load-selection rules and pickup-dispatching rules for multiple-load AGVs
In this paper, we address the problem of load selection and pickup-dispatching of multiple-load AGVs. Various load-selection rules and pickup-dispatching rules are proposed and studied. The objective of this study is twofold. We want to understand not only the performance of load-selection rules and pickup-dispatching rules in two performance criteria—throughput and tardiness, but also the effe...
متن کاملA neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment
A hybrid flow shop (HFS) is a generalized flow shop with multiple machines in some stages. HFS is fairly common in flexible manufacturing and in process industry. Because manufacturing systems often operate in a stochastic and dynamic environment, dynamic hybrid flow shop scheduling is frequently encountered in practice. This paper proposes a neural network model and algorithm to solve the dyna...
متن کامل